GORMEL - Grammar ORiented

GORMEL is a tool for automatic verification of distributed algorithms based on a method proposed in [SG89]. The algorithm is viewed as an infinite family of finite state programs and is described by means of a network grammar. Given a grammar and a specification, we first check that the grammar is inductive and then check the specification on one of the small programs. If a grammar is not inductive, the sys­ tem provides us with a counter example that indicates how the grammar should be converted to an inductive one. The system has been used to verify several algorithms presented in the literature. We examined topologies like trees, rings, buffers and combinations of the above. "This research was partially 8upported by the U.S.I8reali Binationa! Science Foundation. T ec hn io n C om pu te r Sc ie nc e D ep ar tm en t T eh ni ca l R ep or t C S0 69 7. re vi se d 19 91